Compositional virtual timelines: verifying dynamic-priority partitions with algorithmic temporal isolation

Real-time systems power safety-critical applications that require strong isolation among each other. Such needs to be enforced at two orthogonal levels. On the micro-architectural level, this mainly involves avoiding interference through states, such as cache lines. algorithmic is usually achieved by adopting real-time partitions reserve resources for application. Implementations of are often complex and formal verification guarantee proper isolation. In paper, we focus on isolation, which related scheduling-induced interferences. We address earliest-deadline-first (EDF) achieve compositionality utilization, while imposing constraints tasks' periods enforcing budgets these periodic ensure between The a OS kernel challenging due inherent complexity dynamic priority assignment partition level. tackle problem dynamically constructed abstraction lift reasoning concrete scheduler into an abstract domain. Using framework, verify operating system with budget-enforcing EDF prove it indeed ensures partitions. All proofs mechanized in Coq.